A Novel Scalable Optical Packet Compression/decompression Scheme

نویسندگان

  • S. Aleksic
  • V. Krajinovic
  • K. Bengi
چکیده

A novel optical packet compression/decompression scheme is proposed allowing for high compression rates and large packet sizes thereby reducing the rate conversion latency. Extensive simulations are performed in order to investigate the feasibility of the proposed scheme. An OSNR of more than 22 dB is estimated for very large packets. Introduction Ultra-fast access to the optical medium can be particularly obtained by using optical packet compression/decompression technique. Recently, several methods for optical compression and decompression have been proposed. Most of these optical rate conversion schemes are based on an optical recirculating loop and a sampling technique /1//2/. However, this method leads to some restrictions concerning bit-rate and packet size. A further technique for optical packet rate conversion is a feed-forward delay-line structure consisting of q = log2 (N) stages reported in /3/. This technique allows simultaneous compression and decompression of N-bit large optical packets using the same device. Since only passive components are required it is easy to implement, but for larger packet lengths the splitting losses (3 dB per stage) must be compensated by an optical amplifier. However, the maximum packet size is here limited by the compression rate K as: Lp,max = K – 1, where K = T0/τ0. Consequently, for an 100:1 compression (K = 100) Lp,max is limited to 99 bits. Such short packets are usually impractical in many applications. Therefore, we propose a scalable optical packet compression/decompression scheme using a parallel arrangement of Optical Delay Line Lattices (ODLLs). This scheme allows simultaneous compression and decompression of optical packets not limited in size and compression rate. Packet Compression/Decompression Units The proposed scheme depicted in Fig. 1 consists of M parallel compression/decompression units, each of them responsible for the rate-conversion of a part of the optical packet. The principle operation of the device can be described as follows /5/: N–bit large high-speed input packets (at H-S In) are divided into M separate n-bit sequences using a splitter and M bi-directional optical gates. Those sequences are then copied n times in an n-bit ODLL (n = N/M). Each copy is delayed by (T0 – τ0) with respect to the next copy of the packet. A fast OTDM demultiplexer selects bits separated by the bit period T0 within very narrow switching window, thereby down-converting the highspeed sequence. Finally, all M sequences are delayed by an appropriate optical delay line DL2,m and combined by a M × 1 combiner. Thus, the whole high-speed input packet is down-converted. Moreover, by using the same device in the reverse direction, a low-speed packet (with bit period T0) can be compressed. The low-speed optical packet (at LS In) is first divided into M sequences by a 1 × M distributor. Each sequence is then delayed by an appropriate delay line DL2,m and compressed by an n-bit ODLL. The fully compressed sequences are finally selected by the gates and combined by a M x 1 combiner. The result is a high-speed output signal (with bit period τ0) that has the same bit pattern sequence as the low-speed packet. Note that both compression and decompression can occur simultaneously within the same device. M x 1 Combiner M x 1 Combiner 1 x M Splitter 1 x M Distributor OTDM DEMUX

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An optical data rate conversion method for high-speed packed-switched photonic networks

Optical packet compression/expansion allows an ultra-fast media access in packet-switched optical networks. A novel optical packet rate-conversion scheme enabling simultaneous compression/expansion and serial-to-parallel conversion of large optical packets is proposed and investigated. Thereby the rate-conversion time is reduced.

متن کامل

Data-Parallel Decompression of Triangle Mesh Topology

We propose a lossless, single-rate triangle mesh topology codec tailored for fast data-parallel GPU decompression. Our compression scheme coherently orders generalized triangle strips in memory. To unpack generalized triangle strips efficiently, we propose a novel parallel and scalable algorithm. We order vertices coherently to further improve our compression scheme. We use a variable bit-lengt...

متن کامل

Code Compression for VLIW Processors

Code compression is an important issue in the design of an embedded system, since memory has been one of the most restricted resources. Most of the previous work in code compression has targeted RISC architectures, although VLIW processors have gained a lot of popularity recently. In this research, we explore methods to the problem of compressing code for VLIW processors. Previous code compress...

متن کامل

Intelligent scalable image watermarking robust against progressive DWT-based compression using genetic algorithms

Image watermarking refers to the process of embedding an authentication message, called watermark, into the host image to uniquely identify the ownership. In this paper a novel, intelligent, scalable, robust wavelet-based watermarking approach is proposed. The proposed approach employs a genetic algorithm to find nearly optimal positions to insert watermark. The embedding positions coded as chr...

متن کامل

A CLIENT−DRIVEN SCALABLE CROSS−LAYER RETRANSMISSION SCHEME FOR 3G VIDEO STREAMING (FriAmPO1)

The wireless channel is highly time−varying where packet losses often occur during the fading or lossy handovers. In order to avoid unaccepted quality degradation of video streaming over 3G cellular networks, we propose and analyze a novel client−driven scalable cross−layer (CSC) retransmission scheme. Considering the perceptual importance of different video partitions under the real−time and b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001